Evaluation of Bandwidth Constraint Models for MPLS Networks
نویسندگان
چکیده
The paper examines the two basic Bandwidth Constraint models for MPLS networks, called Maximum Allocation Model and Russian Dolls Model, from the point of view of Quality of Service guarantees and introduces the results of performance evaluation of these models in a simulation scenario. We evaluated the influence of the Bandwidth Constraint models on the most important transmission parameters such as throughput, packet loss, oneway delay and jitter.
منابع مشابه
Using a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks
Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...
متن کاملOptimal Coding Subgraph Selection under Survivability Constraint
Nowadays communication networks have become an essential and inevitable part of human life. Hence, there is an ever-increasing need for expanding bandwidth, decreasing delay and data transfer costs. These needs necessitate the efficient use of network facilities. Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets recei...
متن کاملPerformance Evaluation of Preemption Algorithms in MPLS Networks
Preemption is a traffic engineering technique in Multiprotocol Switching Networks that enables creation of high priority paths when there is not enough free bandwidth left on the route. Challenging part of any preemption method is to select the best set of paths for removal. Several heuristic methods are available but no wider comparison had been published before. In this paper, we discuss the ...
متن کاملSupporting End-to-End QoS in DiffServ/MPLS Networks
In MPLS networks, the higher-priority LSP (Label Switching Path) will preempt the resource of lowerpriority LSP when its bandwidth resource is limited. At the time, the lower-priority LSP is destroyed, and its bandwidth resource is released to the higher-priority LSP. The destroyed path has to be rerouted by selecting another LSP; the new LSP maybe quickly suffer another bandwidth resource pree...
متن کاملA Study of Constraint-based Routing with MPLS
This paper presents simulation and analysis of constraint-based routing (CR) with MPLS (multiprotocol label switching). MPLS is basically a fast forwarding scheme for the core of the Internet. Constraint-based routing computes routes that are subject to constraints to meet QoS (quality of service) requirements. Constraint-based routing with MPLS greatly enhances network utilization and enables ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009